Optimal insertion in deterministic DAWGs
نویسندگان
چکیده
منابع مشابه
Asymptotically Optimal Deterministic Rendezvous
In this paper, we address the deterministic rendezvous in graphs where k mobile agents, disseminated at different times and different nodes, have to meet in finite time at the same node. The mobile agents are autonomous, oblivious, labeled, and move asynchronously. Moreover, we consider an undirected anonymous connected graph. For this problem, we exhibit some asymptotical time and space lower ...
متن کاملOptimal Deterministic Sorting and
We present deterministic sorting and routing algorithms for grids and tori with additional diagonal connections. For large loads (h 12), where each processor has at most h data packets in the beginning and in the end, the sorting problem can be solved in optimal hn=6 + o(n) and hn=12 + o(n) steps for grids and tori with diagonals, respectively. For smaller loads, we present a new concentration ...
متن کاملEdge Insertion for Optimal
The edge-insertion paradigm improves a triangulation of a nite point set in < 2 iteratively by adding a new edge, deleting intersecting old edges, and retriangulating the resulting two polygonal regions. After presenting an abstract view of the paradigm, this paper shows that it can be used to obtain polynomial time algorithms for several types of optimal triangulations. Any opinions, nding and...
متن کاملOptimal codes in deletion and insertion metric
We improve the upper bound of Levenshtein for the cardinality of a code of length 4 capable of correcting single deletions over an alphabet of even size. We also illustrate that the new upper bound is sharp. Furthermore we will construct an optimal perfect code capable of correcting single deletions for the same parameters.
متن کاملHardware-optimal test register insertion
Implementing a built-in self-test by a "test per clock" scheme offers advantages concerning fault coverage, detection of delay faults, and test application time. Such a scheme is implemented by test registers, for instance BILBOs and CBILBOs, which are inserted into the circuit structure at appropriate places. An algorithm is presented which is able to find the cost optimal placement of test re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00571-6